Stochastic Games with Disjunctions of Multiple Objectives

Stochastic games combine controllable and adversarial non-determinism with stochastic behavior are a common tool in control, verification synthesis of reactive systems facing uncertainty. Multi-objective natural situations where several - possibly conflicting performance criteria like time energy consumption relevant. Such conjunctive combinations the most studied multi-objective setting literature. In this paper, we consider dual disjunctive problem. More concretely, study turn-based two-player on graphs winning condition is to guarantee at least one reachability or safety objective from given set alternatives. We present fine-grained overview strategy computational complexity such queries (DQs) provide new lower upper bounds for variants problem, significantly extending previous works. also propose novel value iteration-style algorithm approximating Pareto optimal thresholds DQ.